Implementing term rewrite languages in dactl
نویسندگان
چکیده
منابع مشابه
Implementing Term Rewrite Languages in Dactl
Dactl is a low-level language of graph rewriting, intended for programming highly Garallel machines. The language includes, but is not restricted to, the limited form of graph rewriting which is commonly used to implement functional language such as Miranda, ML, Hope and Clean. In contrast to these functional languages, where the order in which subterms are evahtated (the ma!uation strategy) is...
متن کاملImplementing concurrent logic and functional languages in Dactl
A methodology is developed for mapping a wide class of concurrent logic languages (CLLs) onto Dactl, a compiler target language based on generalised graph rewriting. We show how features particular to the generalised graph rewriting model (such as non root overwrites and sharing) can be used to implement CLLs. We identify problems in the mapping of a concurrent logic program to an equivalent se...
متن کاملRewrite Closure of Hedge-automata Languages
We investigate some preservation properties for classes of regular languages of unranked ordered terms under an appropriate generalization of term rewriting subsuming both standard term rewriting and word rewriting. The considered classes include languages of hedge automata (HA) and some extension (called CF-HA) with context-free languages in transitions, instead of regular languages. In partic...
متن کاملSynchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems
Over-approximating the descendants (successors) of an initial set of terms under a rewrite system is used in reachability analysis. The success of such methods depends on the quality of the approximation. Regular approximations (i.e. those using finite tree automata) have been successfully applied to protocol verification and Java program analysis. In [9, 2], non-regular approximations have bee...
متن کاملImplementing Controlled Languages in GF
The paper introduces GF, Grammatical Framework, as a tool for implementing controlled languages. GF provides a high-level grammar formalism and a resource grammar library that make it easy to write grammars that cover similar fragments in several natural languages at the same time. Authoring help tools and automatic translation are provided for all grammars. As an example, a grammar of Attempto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90036-h